Eckhart Böhm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Böhm trees

Böhm trees are the natural infinite generalisations of normal forms in pure λ-calculus. They arose from the work of Böhm on separability (Böhm 1968), and were first identified by Barendregt, who devotes chapter 10 of his book (Barendregt 1980) to their study, and relates denotational models such as D∞ to appropriate quotients over Böhm trees. There is however no generally agreed presentation of...

متن کامل

Computing with Böhm Trees

This paper develops a general technique to analyze the head reduction of a term in a context. This technique is used to give a direct proof of the theorem of Hyland and Wadsworth : two -terms that have the same Böhm trees, up to (possibly infinite) -equivalence, are operationally equivalent. It is also used to prove a conjecture of R. Kerth : Every unsolvable -term has a decoration. This syntac...

متن کامل

An Extensional Böhm Model

We show the existence of an infinitary confluent and normalising extension of the finite extensional lambda calculus with beta and eta. Besides infinite beta reductions also infinite eta reductions are possible in this extension, and terms without head normal form can be reduced to bottom. As corollaries we obtain a simple, syntax based construction of an extensional Böhm model of the finite la...

متن کامل

Böhm-Like Trees for Term Rewriting Systems

In this paper we define Böhm-like trees for term rewriting systems (TRSs). The definition is based on the similarities between the Böhm trees, the Lévy-Longo trees, and the Berarducci trees. That is, the similarities between the Böhm-like trees of the λ-calculus. Given a term t a tree partially represents the root-stable part of t as created in each maximal fair reduction of t. In addition to d...

متن کامل

Infinitary Lambda Calculi and Böhm Models

Infinitely long rewrite sequences of possibly infinite terms are of interest for several reasons. Firstly, infinitary rewriting is a natural generalisation of finitary rewriting which extends it with the notion of computing towards a possibily infinite limit. Such limits naturally arise in the semantics of lazy functional languages, in which it is possible to write and compute with expressions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Der Pathologe

سال: 2020

ISSN: 0172-8113,1432-1963

DOI: 10.1007/s00292-020-00821-9